Set-Based Adaptive Distributed Differential Evolution for Anonymity-Driven Database Fragmentation

نویسندگان

چکیده

Abstract By breaking sensitive associations between attributes, database fragmentation can protect the privacy of outsourced data storage. Database algorithms need prior knowledge in tackled and set it as optimization objective. Thus, effectiveness these is limited by knowledge. Inspired anonymity degree measurement techniques such k -anonymity, an anonymity-driven problem defined this paper. For problem, a set-based adaptive distributed differential evolution (S-ADDE) algorithm proposed. S-ADDE adopts island model to maintain population diversity. Two operators, i.e., mutation crossover, are designed which continuous domain traditional transferred discrete problem. Moreover, operator, each individual’s strategy adaptively selected according performance. The experimental results demonstrate that proposed significantly better than compared approaches. operators verified.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An adaptive invasion-based model for distributed Differential Evolution

http://dx.doi.org/10.1016/j.ins.2014.03.083 0020-0255/ 2014 Elsevier Inc. All rights reserved. ⇑ Corresponding author. Tel.: +39 089 964255. E-mail addresses: [email protected] (I. De Falco), [email protected] (A. Della Cioppa), [email protected] (D. [email protected] (U. Scafuri), [email protected] (E. Tarantino). I. De Falco , A. Della ...

متن کامل

A Novel Query-Driven Clustering-Based Technique for Vertical Fragmentation and Allocation in Distributed Database Systems

In this paper, heuristic query-driven clustering-based vertical fragmentation technique is efficiently developed. The intrinsic idea is to meet the idealistic case of DDBS design which comes to happen as each query attune “closely match” its relevant fragment. The proposed technique is mainly sought to breed clusters of queries in the first place. Consequently, these clusters would be tacitly u...

متن کامل

Slop based Partitioning for Vertical Fragmentation in Distributed Database System

A Vertical Partitioning is the process of dividing the attributes of a relation. Further, a good Vertical Partitioning puts frequently accessed attributes of the relation together in a fragment. Various researchers have proposed different algorithms for Vertical Partitioning. Still, there is a scope of improvement in previous algorithms for Vertical Partitioning. In this paper a new algorithm i...

متن کامل

Horizontal Fragmentation Technique in Distributed Database

Distributed database technology is expected to have a significant impact on data processing in the upcoming years. Today’s business environment has an increasing need for distributed database and Client/server applications as the desire for consistent, scalable, reliable and accessible information is steadily growing. Distributed processing is an effective way to improve reliability and perform...

متن کامل

A Mixed Fragmentation Methodology for Initial Distributed Database Design

We deene mixed fragmentation as a process of simultaneously applying the horizontal and vertical fragmentation on a relation. It can be achieved in one of two ways: by performing horizontal fragmentation followed by vertical fragmentation or by performing vertical fragmentation followed by horizontal fragmentation. The need for mixed fragmentation arises in distributed databases because databas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Data Science and Engineering

سال: 2021

ISSN: ['2364-1541', '2364-1185']

DOI: https://doi.org/10.1007/s41019-021-00170-4